|
|
|
 |
|
|
|
|
|
|
|
|
|
|
Satisfying solutions for a possibilistic linear program
Show Abstract
|
Luhandjula, M.K.
|
1986 |
Information
Sciences
40 (3), pp. 247-265
|
2
|
| | | | |
|
|
(p,q)-Logical completeness for output-coherent sets of (p,q)-Logical
functions and an application of the set to image processing
Show Abstract
|
Haga, T., Fukumura, T.
|
1986 |
Information
Sciences
40 (3), pp. 207-226
|
0
|
| | | | |
|
|
The p-valued-input, q-valued-output threshold logic and the (p,
q)-polypheck-like function
Show Abstract
|
Haga, T., Fukumura, T.
|
1986 |
Information
Sciences
40 (3), pp. 227-246
|
0
|
| | | | |
|
|
Markov reliability models of fault-tolerant distributed computing
systems
Show Abstract
|
Liron, M., Melamed, B., Yau, S.S.
|
1986 |
Information
Sciences
40 (3), pp. 183-206
|
0
|
| | | | |
|
|
Constrained string editing
Show Abstract
|
Oommen, B.J.
|
1986 |
Information
Sciences
40 (3), pp. 267-284
|
11
|
| | | | |
|
|
EFFICIENT COMPUTATION OF THE LOCALLY LEAST-COST INSERTION STRING FOR THE
LR ERROR REPAIR.
Show Abstract
|
Choe, Kwang-Moo, Chang, Chun-Hyon
|
1986 |
Information
Processing Letters
23 (6), pp. 311-316
|
1
|
| | | | |
|
|
WHEN CHASING YOUR TAIL SAVES TIME.
Show Abstract
|
Kieburtz, Richard B.
|
1986 |
Information
Processing Letters
23 (6), pp. 321-324
|
0
|
| | | | |
|
|
CORRECTNESS OF NONDETERMINISTIC PROGRAMS REVISITED.
Show Abstract
|
Holenderski, Leszek, Imperial Coll, London
|
1986 |
Information
Processing Letters
23 (6), pp. 299-303
|
0
|
| | | | |
|
|
LINEAR ALGORITHM FOR THE CUTTING CENTER OF A TREE.
Show Abstract
|
Harary, Frank, Slater, Peter J.
|
1986 |
Information
Processing Letters
23 (6), pp. 317-319
|
2
|
| | | | |
|
|
BIT-STRING LONGEST-COMMON-SUBSEQUENCE ALGORITHM.
Show Abstract
|
Allison, Lloyd, Dix, Trevor I.
|
1986 |
Information
Processing Letters
23 (6), pp. 305-310
|
9
|
| | | | |
|
|
INACCESSIBLE SET: A CLASSIFICATION BY QUERY TYPE OF SECURITY RISKS IN
STATISTICAL DATABASES.
Show Abstract
|
Leiss, Ernst L.
|
1986 |
Information
Processing Letters
23 (6), pp. 275-279
|
0
|
| | | | |
|
|
HALFPLANAR RANGE SEARCH IN LINEAR SPACE AND O(n**0**. **6**9**5) QUERY
TIME.
Show Abstract
|
Edelsbrunner, Herbert, Welzl, Emo
|
1986 |
Information
Processing Letters
23 (6), pp. 289-293
|
7
|
| | | | |
|
|
L-ATTRIBUTED LL(1)-GRAMMARS ARE LR-ATTRIBUTED.
Show Abstract
|
Nakata, Ikuo, Sassa, Masataka
|
1986 |
Information
Processing Letters
23 (6), pp. 325-328
|
0
|
| | | | |
|
|
NEW GENERALIZATION OF DEKKER'S ALGORITHM FOR MUTUAL EXCLUSION.
Show Abstract
|
Martin, Alain
|
1986 |
Information
Processing Letters
23 (6), pp. 295-297
|
1
|
| | | | |
|
|
ON THE COMPLEXITY OF SOME EXTENTED WORD PROBLEMS DEFINED BY CANCELLATION
RULES.
Show Abstract
|
Benois, Michele, Sakarovitch, Jacques
|
1986 |
Information
Processing Letters
23 (6), pp. 281-287
|
2
|
| | | | |
|
|
Upper bounds for configurations and polytopes in Rd
Show Abstract
|
Goodman, J.E., Pollack, R.
|
1986 |
Discrete
& Computational Geometry
1 (1), pp. 219-227
|
18
|
| | | | |
|
|
KNOWLEDGE-BASED DESIGN ON LANS USING SYSTEM ENTITY STRUCTURE
CONCEPTS.
Show Abstract
|
Rozenblit, Jerzy W., Sevinc, Sueleyman, Zeigler, Bernard P.
|
1986 |
Winter
Simulation Conference Proceedings
, pp. 858-865
|
1
|
| | | | |
|
|
Transducers and repetitions
Show Abstract
|
Crochemore, M.
|
1986 |
Theoretical
Computer Science
45 (C), pp. 63-86
|
58
|
| | | | |
|
|
APPLICATIONS OF GSLT (GENERAL SYSTEM LOGICAL THEORY) TO CONTROL IN
TRANSFORMATION SYSTEMS.
Show Abstract
|
Resconi, Germano
|
1986 |
Cybernetics
and Systems
17 (4), pp. 289-329
|
0
|
| | | | |
|
|
WIGNER-VILLE ANALYSIS OF NON-STATIONARY RANDOM SIGNALS, (WITH
APPLICATION TO TURBULENT MICROSTRUCTURE SIGNALS).
Show Abstract
|
Boashash, Boualem, White, Langford, Imberger, Joerg
|
1986 |
ICASSP,
IEEE International Conference on Acoustics, Speech and Signal
Processing - Proceedings
, pp. 2323-2326
|
1
|
| | | | |
